Informatik MCL Master ’ s Thesis on The Subsumption Problem of the Fuzzy Description Logic

Because of the simplicity in the structure of the Description Logic (DL) FL0, it has been commonly taken as the first example for the presentation of new notions and their associated problems [1],[2]. Fuzzy Description Logics extend classical Description Logics by allowing truth degrees to deal with imprecise concepts. In this work we show that in the fuzzy DL FL0 with greatest fixed-point semantics, the subsumption problem can be stated in terms of finite automata. Furthermore, following the new characterization, it was shown that this inference problem lies in the PSPACE-complete complexity class.